Instead of a Conclusion: Some Other Problems with Children’s Rights

Problems with some consequentialist arguments for basic rights

7 Conclusion and Open Problems

A cardinality version of Beigel's nonspeedup theorem. We have shown that the notion of enumeration complexity allows to characterize the query complexity, even in the fault tolerant case. Then we went on to determine for any nite function f : f0; 1g n ! S the extremal values of e(f; A) which can be obtained for some nonrecursive set A. It is open to determine the possible intermediate values. M...

5 Conclusion and Open Problems

cost of the overhead is O(lglg n). Hence the implementation cost is O(lg(jA(v)j), which is proportional to the number of comparisons needed by the Koml os algorithm to nd the heaviest edges in 2m half-paths of the tree in the worst case. Summed over all nodes, this comes to O(n log(m+n n)) as Koml os has shown. The only additional costs are in forming the LCA 0 s which take O(m+n) and in proces...

7. Conclusion 6. Some Extensions of Nafur

31 watch or listen to an activity with a high variation of QoS rather he/she prefers a steady QoS even it is not the best. Let us note that the proposed algorithms can be slightly modified to produce variable quality proposals. To present the details of such modifications is out of scope of the paper. This paper describes work on a new QoS negotiation approach with future reservations (NAFUR) t...

7. Conclusion 6. Some Extensions of Nafur

31 watch or listen to an activity with a high variation of QoS rather he/she prefers a steady QoS even it is not the best. Let us note that the proposed algorithms can be slightly modified to produce variable quality proposals. To present the details of such modifications is out of scope of the paper. This paper describes work on a new QoS negotiation approach with future reservations (NAFUR) t...